Two-Round Multiparty Secure Computation Minimizing Public Key Operations

We show new constructions of semi-honest and malicious two-round multiparty secure computation protocols using only (a fixed) poly(n, λ) invocations of a two-round oblivious transfer protocol (which use expensive public-key operations) and poly(λ, |C|) cheaper one-way function calls, where λ is the security parameter, n is the number of parties, and C is the circuit being computed. All previously known two-round multiparty secure computation protocols required poly(λ, |C|) expensive public-key operations.